Curry–Howard correspondence - PDFSEARCH.IO - Document Search Engine

Curry–Howard correspondence
Results: 226

#	Item
111	General-Elimination Harmony and Higher-Level Rules∗ Stephen Read University of St Andrews September 5, 2013 Add to Reading List Source URL: www.st-andrews.ac.uk Language: English - Date: 2013-09-05 16:41:53 Logic Proof theory Set theory Ordinal arithmetic Curry–Howard correspondence Mathematical logic Mathematics Ordinal numbers
112	Harmony and Modality Stephen Read abstract. It is argued that the meaning of the modal connectives must be given inferentially, by the rules for the assertion of formulae containing them, and not semantically by referenc Add to Reading List Source URL: www.st-andrews.ac.uk Language: English - Date: 2012-05-15 10:27:11 Mathematics Deduction Natural deduction Ordinal numbers Set theory Curry–Howard correspondence Mathematical logic Proof theory Logic
113	Extracting Feasible Programs Add to Reading List Source URL: aaai.org Language: English - Date: 2006-01-11 06:16:21 Proof theory Functions and mappings Logic in computer science Function Primitive recursive function Curry–Howard correspondence Second-order logic Modal logic Computational complexity theory Mathematics Logic Mathematical logic
114	On Linear Inference Frank Pfennnig Draft of February 2, 2008 Inference. When we write an inference rule Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-05-14 10:37:05 Non-classical logic Logical consequence Proof theory Entailment Linear logic Inference Curry–Howard correspondence Proposition Rule of inference Logic Propositional calculus Logical syntax
115	ZU064-05-FPR main 29 April 2011 Add to Reading List Source URL: www.mpi-sws.org Language: English - Date: 2011-04-29 09:44:18 Theoretical computer science Curry–Howard correspondence Dynamical system Polymorphism Parametricity Type system Denotational semantics Type theory Software engineering Programming language theory
116	Automated Theorem Proving Frank Pfenning Carnegie Mellon University Draft of Spring 2004 Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2004-04-13 10:08:54 Natural deduction Sequent Intuitionistic logic Judgment Cut-elimination theorem Linear logic Curry–Howard correspondence First-order logic Rule of inference Logic Mathematical logic Proof theory
117	Pretending Atomicity Leslie Lamport and Fred B. Schneider May 1, 1989 ii Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2013-05-31 14:07:02 Symmetry Mathematical logic Theoretical computer science Program logic Proof theory Curry–Howard correspondence Predicate transformer semantics Mathematics Group action Group theory
118	ZU064-05-FPR impldtp 15 September 2013 Add to Reading List Source URL: eb.host.cs.st-andrews.ac.uk Language: English - Date: 2013-09-15 12:12:41 Programming language theory Data types Functional programming Dependently typed programming Logic in computer science Lambda calculus System F Type system Curry–Howard correspondence Software engineering Computing Type theory
119	Theory and Applications of Categories, Vol. 28, No. 32, 2013, pp. 1139–[removed]THE GLEASON COVER OF A REALIZABILITY TOPOS PETER JOHNSTONE Abstract. Recently Benno van den Berg [1] introduced a new class of realizability Add to Reading List Source URL: www.emis.de Language: English - Date: 2013-12-13 13:03:00 Sheaf theory Topos Heyting algebra Curry–Howard correspondence Sheaf Mathematics Abstract algebra Algebra
120	The Undecidability of k-Provability Samuel R. Buss∗ Department of Mathematics University of California, San Diego April 3, 1989 Add to Reading List Source URL: www.math.ucsd.edu Language: English - Date: 2002-07-11 12:08:00 Automated theorem proving Mathematics Sequent calculus Unification Sequent First-order logic Curry–Howard correspondence Natural deduction Mathematical logic Proof theory Logic